Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis March 9, Spring 2011

Source URL: courses.csail.mit.edu

• Analysis of algorithms
• Binary trees
• Computational complexity theory
• Asymptotic analysis
• Sorting algorithms
• Best
• worst and average case
• Binary heap
• Heap
• Time complexity
• Hash table
• Binary search tree
• Master theorem

P, N P and mathematics – a computational complexity perspective Avi Wigderson December 21, 2006 “P versus N P – a gift to mathematics from computer science” Steve Smale

Source URL: www.math.ias.edu

RelaxMiddle-JSCStyle-sent.pdf

Source URL: www.csd.uwo.ca

• Multiplication
• Computational complexity theory
• Finite fields
• Multiplication algorithm
• Fast Fourier transform
• Factorial
• Time complexity
• XTR
• SchnhageStrassen algorithm
• Karatsuba algorithm

Algorithms and Data Structures Winter TermExercises for Unit 6 s 1. Spell out the general divide-and-conquer algorithm for multiplying polymomials that was

Source URL: www-tcs.cs.uni-sb.de

• Multiplication
• Binary operations
• Algebra
• Computational complexity theory
• Time complexity
• Polynomial
• Multiplication algorithm
• Karatsuba algorithm

PAC Learning and Artificial Neural Networks Martin Anthony and Norman Biggs Department of Mathematics, London School of Economics and Political Science (University of London), Houghton St., London WC2A 2AE, United Kingdo

Source URL: www.maths.lse.ac.uk

• Computational learning theory
• Artificial neural networks
• Machine learning
• Computational statistics
• Learning
• VC dimension
• Sample complexity
• Probably approximately correct learning
• Backpropagation
• Perceptron
• Vladimir Vapnik
• Radial basis function network

Selfish routing with oblivious users George Karakostas1? , Taeyon Kim1?? , Anastasios Viglas2 , and Hao Xia1? ? ? 1 2

Source URL: www.cas.mcmaster.ca

• Mathematics
• Computational complexity theory
• Graph theory
• Game theory
• Price of anarchy
• Net
• Flow network
• NC
• Shortest path problem
• Closed and exact differential forms

RTGBeing Stubborn: Developing Optimal Solution Strategies for a Scheduling Problem Despite its NP-Hardness Dr. Oliver Sinnen Department of Electrical and Computer Engineering

Source URL: grk1855.tu-dortmund.de

• Computational complexity theory
• Theory of computation
• Combinatorial optimization
• Complexity classes
• Operations research
• Integer programming
• Heuristic
• Branch and bound
• NP
• Optimization problem
• Pruning
• Reduction

T HEOREMS AS PROBLEMS S TRONG REDUCTIONS O MNISCIENT REDUCTIONS

Source URL: ludovicpatey.com

• Computational complexity theory
• Computability theory
• Structural complexity theory
• Approximation algorithms
• Reduction
• L
• Simple set
• Approximation-preserving reduction

Local Checkability, No Strings Attached Klaus-Tycho Förster, Thomas Lüdi, Jochen Seidel, Roger Wattenhofer Wednesday – December 09, 2015 @MIT: Theory of Distributed Systems Group ETH Zurich – Distributed Computing

Source URL: www.disco.ethz.ch

• Complexity classes
• Distributed computing
• NP
• Computational complexity theory
• P
• NC

Auto-Approximation of Graph Computing Zechao Shang, Jeffrey Xu Yu The Chinese University of Hong Kong Motivation I

Source URL: acmsocc.github.io

• Mathematical analysis
• Mathematics
• Approximation algorithm
• Computational complexity theory
• Algorithm
• Pi
• Approximation error
• Logarithm